public class Test05 {
    public static int searchInsert(int[] nums, int target) {

        int left = 0;
        int right = nums.length-1;
        int t = -1;
        while(left<=right){
            int mid = left + (right-left)/2;
            if(nums[mid]<target){
                left = mid+1;
            }else if(nums[mid]>target){
                t=mid;
                right=mid-1;
            }else{
                return mid;
            }
        }
        if(t==-1){
            return nums.length;
        }
        return t;
    }
    public static int search(int[] nums, int target) {

        int left = 0;
        int right = nums.length-1;
        while(left<=right){
            int mid = left+(right-left)/2;
            if(nums[mid]<target){
                left=mid+1;
            }else if(nums[mid]>target){
                right=mid-1;
            }else{
                return mid;
            }
        }
        return -1;
    }
    public static void main(String[] args) {
     int[] arr = new int[]{1,3,5,6};
     int a = searchInsert(arr,7);
        System.out.println(a);

    }
}
